Concerning the problems of the lack of a large number of relationships in the current Knowledge Graph (KG), and the lack of full consideration of the hidden information in the multi-hop path between two entities when performing relationship reasoning, a relationship reasoning method combining multi-hop relationship path information was proposed. Firstly, for the given candidate relationships and two entities, the convolution operation was used to encode the multi-hop relationship path connecting the two entities into a low-dimensional space and extract the information. Secondly, the Bidirectional Long Short-Term Memory (BiLSTM) network was used for modeling to generate the relationship path representation vector, and the attention mechanism was used to combine it with the candidate relationship representation vector. Finally, a multi-step reasoning method was used to find the relationship with the highest matching degree as the reasoning result and judge its precision. Compared with the current popular Path Ranking Algorithm (PRA), the neural network model named Path-RNN and reinforcement learning model named MINERVA, the proposed algorithm had the Mean Average Precision (MAP) increased by 1.96,8.6 and 1.6 percentage points respectively when using the large-scale knowledge graph dataset NELL995 for experiments. And when using the small-scale knowledge graph dataset Kinship for experiments, the proposed algorithm had the MAP improved by 21.3,13 and 12.1 percentage points respectively compared to PRA and MINERVA. The experimental results show that the proposed method can infer the relationship links between entities more accurately.

Cyber Physical System (CPS) involves the integration and collaboration of various computing models. Concerning the problems of inconsistent CPS design methods, poor plasticity, high complexity and difficulty in collaborative modeling and verification, a structured and descriptive heterogeneous component model was proposed. Firstly, the model was constructed by a unified component modeling method to solve the problem that the model was not open. Then, eXtensible Markup Language (XML) was used to realize the standard description of all kinds of components to resolve the inconsistency and non-extensibility of different computing model description languages. Finally, the collaborative simulation verification method of multi-level open component model was used to realize the simulation verification to solve the non-collaboration problem of verification. The medical thermostat was modeled, described and simulated by the general component modeling method, the XML component standard description language and the verification tool platform XModel. The case of medical thermostat shows that, the proposed model-driven process of building reconfigurable heterogeneous components and confirming their design correctness supports the collaborative design of cyber physics and the correction while constructing, avoiding repeated modifications when problems are found in the process of system implementation.

In view of the problem that the existing researches do not consider the refinement of the factors affecting the network negative energy propagation and construct a propagation dynamics model for analysis, a Weak-Strong-Received-Infected-Evil (WSRIE) model of network negative energy propagation was proposed. Firstly, considering the difference of negative energy immunity and propagation ability of network users, the vulnerable states were divided into weak immunity and strong immunity, and the infectious states were divided into weak infection, strong infection and malicious propagation with unchanged scale. Secondly, according to the negative energy infection mechanism of the network, the state transition law was proposed. Finally, a dynamics model of network negative energy propagation for complex networks was constructed. The simulation comparison experiments on NW small world network and BA scale-free network were carried out. The simulation results show that under the same parameters, the weak immune node density of the NW network is 9 percentage points lower than that of the BA network, indicating that the network with small world characteristics is more susceptible to negative energy. In the BA network, the density of infected nodes with the malicious node degree of 200 is 5 percentage points higher than that with the node degree of 0, indicating that the greater the node degree of the network red opinion leader, the more network users affected by the network negative energy.

For the problem that qualitative analysis methods are mostly adopted for the study of spam information propagation and it is difficult to reveal intrinsic propagation rules of spam information propagation, an ILDR (Ignorant-Lurker-Disseminator-Removed) model of spam information was proposed based on the idea of virus propagation modeling by considering the actual factors such as different input rates and removal rates. Firstly, the equilibrium point and the propagation threshold were calculated, and the stability conditions of the equilibrium point were given. Secondly, the local stability of non-spam information and spam information was proved by the Routh-Hurwitz criterion, then the global stability of non-spam information was certified via the invariance principle of LaSlle, which was proved based on the Bendixson criterion. Theoretical research shows that the non-spam information equilibrium is global asymptotically stable when propagation threshold is less than 1; the spam information equilibrium is global asymptotically stable when propagation threshold is greater than 1. The numerical simulation validates that the value of the propagation threshold can be decreased when decreasing the transfer rate from the lurker to the disseminator, increasing the transfer rate from the ignorant to the remover and the transfer rate from the lurker to the remover; the value of the disseminator can be decreased via increasing the proportionality coefficient from the ignorant to the lurker, or increasing the transfer rate of the disseminator to the remover and the system removal rate.

In the view of the problem that the portability and expansibility current flight delay platform in China can not adapt to the status of large data storage brought by rapid development of Chinese civil aviation, a flight delay big data platform with cross platform, high availability and high expansion was designed. The platform used a big data tool LeafLet as a visual carrier, displayed the flight trajectory in the map interface, and loaded trajectory data to HBase database. Message-Digest Algorithm (MD5) algorithm was used to redesign and optimize the rowkey of flight data table to solve its "hot spot" problem brought by incremental flight time. Considering the shortcomings of multi-level query of HBase filter, a query algorithm based on SolrCloud was proposed, which utilized SolrCloud to realize hierarchical storage of row and index fields, so as to realize HBase two-level fast indexing. Finally, based on historical flight data and flight plan data of HBase, a massive flight information data warehouse based on Hive was constructed. The experimental results show that the expensibility of large data platform for flight delays and the construction of flight information data warehouse can meet the demand of civil aviation for unified storage of data, and the response speed of the multi-condition query is improved by hundreds of times compared with the cluster without second index, and this advantage becomes more and more obvious as the flight data amount grows.

The impact of individual interest and refutation mechanism on rumor spread was investigated, and a new IWSR (Ignorant-Weak spreader-Strong spreader-Removal) rumor spread model was proposed. The basic reproduction number and equilibrium points of the model were calculated. Using Lyapunov stability theorem, Hurwitz criterion and LaSalle invariance principle, the local stability and global stability of some equilibrium points were proved. Through numerical simulations, it is concluded that increasing the effectivity of the governments' refutation actions or improving people' ability of rumor judgement can effectively suppress rumor spread. Finally, numerical simulations were conducted in WS (Watts-Strogatz) small-world network and BA (Barabási-Albert) scale-free network, showing that the network topology exerts significant influence on rumor spread.

Concerning the high complexity of the traditional frequency estimation algorithm, a new frequency offset estimation algorithm of Time Domain Synchronous Orthogonal Frequency Division Multiplexing (TDS-OFDM) with low complexity for power line communication was proposed. Firstly, the characteristics of power line network were analyzed, and a frame head was constructed with three equal-length cyclic Pseudo-random Noise (PN) sequences. Secondly, the frame head and body were based on Binary Phase Shift Keying (BPSK) and Quadrature Amplitude Modulation (QAM) modes. Finally, compared with the traditional algorithms based on Cyclic Prefix (CP) or general PN, only the lengths of part of PN were calculated, so the number of autocorrelations was reduced, and better performance could be guaranteed. The simulation results show that, at Bit Error Rate (BER) of 10 ^-4, the improved algorithm has about 5 dB and 1 dB gains while comparing with the algorithms based on CP and general PN, respectively. And compared with algorithm with general PN, when the lengths of inserted sequence and cyclic sequence were 420 and 165, the number of correlations per frame was reduced by 1186. The theoretical analysis and simulation results show that proposed algorithm can effectively reduce the computational complexity and cost of process, meanwhile improves the communication rate.

Traditional relational data storage systems have been criticized by poor performance and lacking of fault tolerance, therefore it cannot satisfy the efficiency requirement of the massive unstructured data management. A non-relational storage management mechanism with high-performance and high-availability was proposed. First, a user-friendly application interface was designed, and data could be distributed to multiple storage nodes through efficient consistent hashing algorithm. Second, a configurable data replication mechanism was presented to enhance availability of the storage system. Finally, a query fault handling mechanism was proposed to improve the storage system's fault-tolerance and avoid service outages, which were caused by the node failure. The experimental results show that the concurrent access capacity of the proposed storage system increases by 30% and 50% respectively compared to traditional file system and relational database under different user workloads; meanwhile, the availability loss of the storage system under the fault state is less than 14% in a reasonable response time. Therefore, it is applicable for efficient storage management of massive unstructured data.

MapReduce computation model can not satisfy the efficiency requirement of graph data processing in the Hadoop cloud platform. In order to address the issue, a novel computation framework of graph data processing, called MyBSP (My Bulk Synchronous Parallel), was proposed. MyBSP is similar with Pregel developed from Google. Firstly, the running mechanism and shortcomings of MapReduce were analyzed. Secondly, the structure, workflow and principal interfaces of MyBSP framework were described. Finally, the principle of the PageRank algorithm for graph data processing was analyzed. Subsequently, the design and implementation of the PageRank algorithm for graph data processing were presented. The experimental results show that, the iteration processing performance of graph data processing algorithm based on the MyBSP framework is raised by 1.9-3 times compared with the algorithm based on MapReduce. Furthermore, the execution time of the MyBSP algorithm is reduced by 67% compared with MapReduce approach. Thus, MyBSP can efficiently meet the application prospect of graph data processing.

Due to the better robustness of entangled W state, it is considered to be better qualified as information carrier for quantum information processing and quantum secure communication. Recently, many kinds of quantum direct communication protocols based on four-particle W state or three-particle asymmetric W state have been proposed. However, these protocols either have low communication efficiency or are difficult to be implemented in physics experiment. By utilizing three-particle W state and the mechanism of quantum identity authentication, a new deterministic secure quantum communication protocol was proposed. This protocol consisted of five parts: authentication code generating, quantum states preparation, quantum states distribution, eavesdropping check and identity authentication, and information communication. The two participants only needed to perform the two-particle Bell measurement, the single-particle 〖WTBX〗Z〖WTBZ〗-basis or 〖WTBX〗X〖WTBZ〗-basis measurement, and the communication efficiency was also improved: One W state can transmit one classical bit of information. The security analysis shows that the present protocol is secure against various eavesdropper Eve's attacks and impersonation attacks, so it has better security.

To carry out lens distortion correction of unknown camera parameters, a method calibrating distortion center first and distortion coefficient second was proposed. First, with target imaged at two different focal lengths, distortion center could be positioned using relative position relation of the same target points in two pictures; then according to the invariance of line perspective projection, distortion coefficient could be searched by variable step optimization method. The simulation experiment showed that the average error of distortion center was (0.2243,0.1636) pixel, and the distortion coefficient error was 0.28% when target point number was 25, the noise level was 0.2 pixel. Real image experiment shows that distortion center and distortion coefficient obtained by the proposed method can correct the image well. The method is easy to implement, the calibration of camera's internal and external parameters and the knowledge of line grid's world coordinates can be neglected.

Concerning the fuzzy and unclear details after color image denoising, the correlation properties of the adjacent pixels as well as the correlation among the color channels were analyzed. First, one-step singular correlation detection algorithm was used to detect the noises of each layer of the pre-treatment color image, and then the most relevant vector median was used to fill value of the noises. Finally, the color image filtering processing was realized. The experimental results show that this method not only accurately detects the salt-pepper noises, but also well restores and protects the original information such as the edge details. The color image filtering accuracy and performance criterion such as Peak-Signal-to Noise Ratio (PSNR) are further improved.

The security of E-commerce determines its development; however, traditional means of security certification cannot meet the demand on reliability. To ensure the security in E-commerce communication, a new method of security certification was proposed based on rolled fingerprint reconstruction and digital signature. Firstly, the image sequence of rolling fingerprints was reconstructed into a high-quality complete fingerprint image, and then the features were extracted as the key of digital signature. Thirdly, the message embedded with digital signature was transferred. At the same time, the correctness and completeness of the message were checked, and the validity of the sender was also identified. The experimental results show that the proposed algorithm can be used for rolling fingerprint reconstruction in any direction to get a high-quality fingerprint image. And it can run in real-time because of low complexity. The rolling fingerprint, as the security certification medium, ensures the security of E-commerce.